The size of spanning disks
نویسندگان
چکیده
For each integer n > 1 we construct a closed unknotted PL curve Kn in R 3 having less than 33n edges with the property that any PL triangluated disk spanning the curve contains at least 2 n triangles.
منابع مشابه
SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملThe Size of Spanning Disks for Polygonal Curves
For each integer n ≥ 0, there is a closed, unknotted, polygonal curve Kn in R3 having less than 10n + 9 edges, with the property that any Piecewise-Linear triangulated disk spanning the curve contains at least 2n−1 triangles.
متن کاملCuttings for Disks and Axis-Aligned Rectangles in Three-Space
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1r -cutting is a covering of the space with simplices such that the interior of each simplex intersects at most n/r objects. For n pairwise disjoint disks in R and a parameter r ∈ N, we construct a 1r -cutting of size O(r). For n axis-a...
متن کاملar X iv : m at h / 99 06 19 7 v 1 [ m at h . G T ] 2 8 Ju n 19 99 The size of spanning disks for polygonal knots .
For each integer n ≥ 1 we construct a closed unknotted Piecewise Linear curve Kn in R 3 having less than 11n edges with the property that any Piecewise Linear triangluated disk spanning the curve contains at least 2 triangles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998